Massively Parallel Visualization: Parallel Rendering
نویسندگان
چکیده
This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume renderer use a MIMD approach. Implementations for these algorithms are presented for the Thinking Machines Corporation CM-5 MPP.
منابع مشابه
Interactive Visualization of Three Dimensional Cellular Automata
This paper summarizes results of a project on a massively parallel computer. The project encompasses time evolution of a complex system, data analysis of the relevant measures and interactive visualization of the time dependent emerging structures within an integrated tool. We develop visualization and interpretation models for the general class of 3D and (3 + 1)D multi{state elds, represented ...
متن کاملA Heterogeneous Graphics Procedure for Visualization of Massively Parallel Solutions *
P. J. Crossno, et. al. * Accepted for presentation at ASME Fluids Engineering Conference, June 20-24, 1993 Washington, D.C. ABSTRACT Scientific visualization is playing an increasingly important role in the analysis and interpretation of massively parallel CFD simulations due to the enormous volume of data that can be generated on these machines. In this paper we will describe the development o...
متن کاملCoupling Massively Parallel Volume Rendering with Autostereoscopic 3D Display Environments
Scientific datasets are growing at incredible rates, resulting in two challenges for visualization researchers and domain scientists: maintaining performance and extracting meaningful content. These tasks have always been goals of scientific visualization, but their importance – and difficulty – grows with the scale of the data. At Argonne National Laboratory, we have been attacking these two c...
متن کاملMassively parallel inverse rendering using Multi-objective Particle Swarm Optimization
We present a novel GPU-accelerated per-pixel inverse rendering optimization algorithm based on Particle Swarm Optimization (PSO). Our algorithm estimates the per-pixel scene attributes—including reflectance properties—of a 3D model, and is fast enough to do in situ visualization of the optimization in real-time. The algorithm’s high parallel efficiency is demonstrated through our GPU/GLSL shade...
متن کاملUsed with permission IEEE GG A July Parallel Volume Rendering Using Binary Swap Image Composition
This paper presents a divide and conquer ray traced vol ume rendering algorithm and a parallel image compositing method along with their implementation and performance on the Connection Machine CM and networked worksta tions This algorithm distributes both the data and the computations to individual processing units to achieve fast high quality rendering of high resolution data The volume data ...
متن کامل